Approximating the discrete time-cost tradeoff problem with bounded depth

نویسندگان

چکیده

Abstract We revisit the deadline version of discrete time-cost tradeoff problem for special case bounded depth. Such instances occur example in VLSI design. The depth an instance is number jobs a longest chain and denoted by d . prove new upper lower bounds on approximability. First we observe that can be regarded as finding minimum-weight vertex cover -partite hypergraph. Next, study natural LP relaxation, which solved polynomial time fixed and—for instances—up to arbitrarily small error general. Improving prior work Lovász Aharoni, Holzman Krivelevich, describe deterministic algorithm with approximation ratio slightly less than $$\frac{d}{2}$$ d 2 hypergraphs given -partition. This tight yields also -approximation general instances, even if not fixed. inapproximability show no better $$\frac{d+2}{4}$$ + 4 possible, assuming Unique Games Conjecture $$\text {P}\ne \text {NP}$$ P ≠ NP strengthens result Svensson [21], who showed under same assumptions constant-factor exists (of unbounded depth). Previously, only APX-hardness was known

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

متن کامل

Approximating the MaxCover Problem with Bounded Frequencies in FPT Time

We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N , and an integer K. The goal is to find up to K sets from S that jointly cover (i.e., include) as many elements as possible. This problem is well-known to be NP-hard and, under stan...

متن کامل

An Algorithm for the Discrete Time-Cost Tradeoff Problem Based on Lagrangean Relaxation

This paper deals with the discrete time-cost tradeoff problem (DTCTP) which is well-known to be NP-hard. We propose to compute lower bounds based on Lagrangean relaxation. The basic idea is to decompose the activity-on-node network into subnetworks by relaxing some precedence constraints. Partial solutions provided by the lower bounds are used also to compute upper bounds, that is feasible solu...

متن کامل

The stochastic time-cost tradeoff problem: A robust optimization approach

We consider the problem of allocating resources to projects performed under given due dates and stochastic time–cost tradeoff settings. In particular, we show how to implement a state-of-the-art methodology known as “robust optimization” to solve the problem. In contrast to conventional approaches, the model we develop results in management policies rather than optimal values for the original d...

متن کامل

A New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2022

ISSN: ['0025-5610', '1436-4646']

DOI: https://doi.org/10.1007/s10107-022-01777-9